Algebraic methods proving Sauer's bound for teaching complexity
نویسندگان
چکیده
منابع مشابه
Sauer's Bound for a Notion of Teaching Complexity
This paper establishes an upper bound on the size of a concept class with given recursive teaching dimension (RTD, a teaching complexity parameter.) The upper bound coincides with Sauer’s well-known bound on classes with a fixed VC-dimension. Our result thus supports the recently emerging conjecture that the combinatorics of VC-dimension and those of teaching complexity are intrinsically interl...
متن کاملAlgebraic Methods in Computational Complexity Dagstuhl Seminar
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 Algebraic Methods in Computational Complexity was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are ...
متن کاملABS methods for nonlinear systems of algebraic equations
Abstract This paper gives a survey of the theory and practice of nonlinear ABS methods including various types of generalizations and computer testing. We also show three applications to special problems, two of which are new.
متن کاملislanding detection methods for microgrids
امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...
15 صفحه اولSome notes on two lower bound methods for communication complexity
We compare two methods for proving lower bounds on standard two-party model of communication complexity, the Rank method and Fooling set method. We present bounds on the number of functions f(x, y), x, y ∈ {0, 1}n, with rank of size k and fooling set of size at least k, k ∈ [1, 2n]. Using these bounds we give a novel proof that almost all Boolean functions f are hard, i.e., the communication co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.09.024